Reconstructing some bipartite graphs from their spanning trees
نویسنده
چکیده
Throughout, we shall understand a graph to be an undirected, connected graph without loops or multiple edges, and a spanning tree of a graph G to be a connected subgraph of G without circuits which includes every vertex of G. In [ 11, Sedlacek has asked which graphs are uniquely reconstructable from their spanning trees, and calls such graphs URST graphs. More precisely, we say G is a URST graph if it has the following property:
منابع مشابه
Counting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملNUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
متن کاملUpper Bounds on the Number of Spanning Trees in a Bipartite Graph
Ferrers graphs are a family of connected bipartite graphs that arise from the Ferrers diagram of a partition. Ehrenborg and van Willigenburg gave a beautiful product formula for the number of spanning trees in a Ferrers graph. In this paper, we use linear algebraic techniques to investigate a conjecture of Ehrenborg stating that a similar product formula gives an upper bound for the number of s...
متن کاملThe distinguishing chromatic number of bipartite graphs of girth at least six
The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...
متن کاملMinimum congestion spanning trees in bipartite and random graphs
The first problem considered in this paper: is it possible to find upper estimates for the spanning tree congestion for bipartite graphs which are better than for general graphs? It is proved that there exists a bipartite version of the known graph with spanning tree congestion of order n 3 2 , where n is the number of vertices. The second problem is to estimate spanning tree congestion of rand...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 29 شماره
صفحات -
تاریخ انتشار 1980